NORTHWESTERN UNIVERSITY Collaborative Multiple Kernel Tracking: Theory and Algorithms

نویسندگان

  • Zhimin Fan
  • Ying Wu
چکیده

To make the kernel-based tracking algorithms more reliable, in this work, we mainly deal with two major singular cases in kernel-based tracking, concerned with kernel observability and tracking stability. Singular kernel observability indicates that the motions of interest cannot be uniquely recovered by the kernel. We present a novel multiple collaborative kernel approach, in which a complex motion is represented by a set of inter-correlated simpler motions. With this formulation, we present a rigorous analysis on a critical issue of kernel observability and obtain a criterion, based on which we propose a new method using collaborative kernels that has the theoretical guarantee of enhanced observability. This new method has been shown to be computationally efficient in both theory and practice, which can be readily applied to complex motions such as articulated motions. Another singular case, unstableness in tracking, is caused by inappropriate kernel placement, which requires research on optimal kernel placement. The theoretical analysis presented in this work indicates that the optimal kernel placement can be evaluated based on a closed-form criterion, and achieved efficiently by a novel gradient-based algorithm. Based on that, new methods for temporal-stable 2 multiple kernel placement and scale-invariant kernel placement are also proposed. These new theoretical results and new algorithms greatly advance the study of kernel-based tracking in both theory and practice. Extensive experimental results demonstrate the improved tracking reliability.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Visual Tracking using Kernel Projected Measurement and Log-Polar Transformation

Visual Servoing is generally contained of control and feature tracking. Study of previous methods shows that no attempt has been made to optimize these two parts together. In kernel based visual servoing method, the main objective is to combine and optimize these two parts together and to make an entire control loop. This main target is accomplished by using Lyapanov theory. A Lyapanov candidat...

متن کامل

Demand - based dynamic distribution of attention and 2 monitoring of velocities during multiple - object tracking

4 5 Department of Psychology, Northwestern University, 6 Evanston, IL, USA AQ1 7 Lucica Iordanescu 8 9 Department of Psychology, Northwestern University, 10 Evanston, IL, USA, & 11 Interdepartmental Neuroscience Program, 12 Northwestern University, Evanston, IL, USA AQ1 3 Marcia Grabowecky 14 15 Department of Psychology, Northwestern University, 16 Evanston, IL, USA, & 17 Interdepartmental Neur...

متن کامل

Multiple Target Tracking in Wireless Sensor Networks Based on Sensor Grouping and Hybrid Iterative-Heuristic Optimization

A novel hybrid method for tracking multiple indistinguishable maneuvering targets using a wireless sensor network is introduced in this paper. The problem of tracking the location of targets is formulated as a Maximum Likelihood Estimation. We propose a hybrid optimization method, which consists of an iterative and a heuristic search method, for finding the location of targets simultaneously. T...

متن کامل

Using a Novel Concept of Potential Pixel Energy for Object Tracking

Abstract   In this paper, we propose a new method for kernel based object tracking which tracks the complete non rigid object. Definition the union image blob and mapping it to a new representation which we named as potential pixels matrix are the main part of tracking algorithm. The union image blob is constructed by expanding the previous object region based on the histogram feature. The pote...

متن کامل

A Gravitational Search Algorithm-Based Single-Center of Mass Flocking Control for Tracking Single and Multiple Dynamic Targets for Parabolic Trajectories in Mobile Sensor Networks

Developing optimal flocking control procedure is an essential problem in mobile sensor networks (MSNs). Furthermore, finding the parameters such that the sensors can reach to the target in an appropriate time is an important issue. This paper offers an optimization approach based on metaheuristic methods for flocking control in MSNs to follow a target. We develop a non-differentiable optimizati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005